منابع مشابه
Sequential Vector Packing
We introduce a novel variant of the well known d-dimensional bin (or vector) packing problem. Given a sequence of non-negative d-dimensional vectors, the goal is to pack these into as few bins as possible. In the classical problem the bin size vector is given and the sequence can be partitioned arbitrarily. We study a variation where the vectors have to be packed in the order in which they arri...
متن کاملOn-line Sequential Bin Packing
We consider a sequential version of the classical bin packing problem in which items are received one by one. Before the size of the next item is revealed, the decision maker needs to decide whether the next item is packed in the currently open bin or the bin is closed and a new bin is opened. If the new item doesn’t fit, it is lost. If a bin is closed, the remaining free space in the bin accou...
متن کاملPacking vector spaces into vector spaces
A partial t-spread in Fq is a collection of t-dimensional subspaces with trivial intersection such that each non-zero vector is covered at most once. How many t-dimensional subspaces can be packed into Fq , i.e., what is the maximum cardinality of a partial t-spread? An upper bound, given by Drake and Freeman, survived more than forty years without any improvement. At the end of 2015, the upper...
متن کاملSequential Support Vector Classi
1 Abstract Support Vector Machines(SVMs) map the input training data into a high dimensional feature space and nds a maximal margin hyperplane separating the data in that feature space. Extensions of this approach account for non-separable or noisy training data (soft classiiers) as well as support vector based regression. The optimal hyperplane is usually found by solving a quadratic programmi...
متن کاملSequential Support Vector Machines
In this paper, we derive an algorithm to train support vector machines sequentially. The algorithm makes use of the Kalman lter and is optimal in a minimum variance framework. It extends the support vector machine paradigm to applications involving real-time and non-stationary signal processing. It also provides a computationally eecient alternative to the problem of quadratic optimisation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.07.027